Simulation and analysis of some dynamic priority schemes in two-class queues

In this paper, we analyse two important and relatively complex performance measures, tail probability and switching frequency, for two class queueing system with two different (relative and earliest due date based) dynamic priority schemes across classes. A simulator is build to perform such analysis and various observations are made. Based on computational evidence, it is conjectured that two stage exponential queueing network with two classes of customers is decomposable as far as mean waiting times are concerned when relative priority is used across classes to schedule the customers. Based on further experiments, it is conjectured that departure processes with relative dynamic priority are Poisson in two class exponential queue. Dynamic priority, simulation, multi-class queues, queuing network, optimal control